The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
نویسندگان
چکیده
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1, t1), . . . ,(sp, tp)} of nodes in the graph, one has to find the smallest subgraph H of G that contains paths from si to ti for all i. The problem is NP-hard for general p, since the DIRECTED STEINER TREE problem is a special case. Until now, the complexity was unknown for constant p≥ 3. We prove that the problem is polynomially solvable if p is any constant number, even if nodes and edges in G are weighted and the goal is to minimize the total weight of the subgraph H. In addition, we give an efficient algorithm for the STRONGLY CONNECTED STEINER SUBGRAPH problem for any constant p, where given a directed graph and p nodes in the graph, one has to compute the smallest strongly connected subgraph containing the p nodes.
منابع مشابه
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)
Given a directed graph G and a list (s1, t1), . . . , (sk, tk) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G that contains a directed si → ti path for every 1 ≤ i ≤ k. The special case Directed Steiner Tree (when we ask for paths from a root r to terminals t1, . . . , tk) is known to be fixed-parameter tractable parameterized by the number of term...
متن کاملThe Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems∗
Given a directed graph G and a list (s1, t1), . . . , (sk, tk) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G that contains a directed si → ti path for every 1 ≤ i ≤ k. The special case Directed Steiner Tree (when we ask for paths from a root r to terminals t1, . . . , tk) is known to be fixed-parameter tractable parameterized by the number of term...
متن کاملParameterized Complexity of Directed Steiner Tree on Sparse Graphs
We study the parameterized complexity of the directed variant of the classical Steiner Tree problem on various classes of directed sparse graphs. While the parameterized complexity of Steiner Tree parameterized by the number of terminals is well understood, not much is known about the parameterization by the number of non-terminals in the solution tree. All that is known for this parameterizati...
متن کاملComplexity of the Steiner Network Problem with Respect to the Number of Terminals
In the Directed Steiner Network problem we are given an arc-weighted digraph G, a set of terminals T ⊆ V (G), and an (unweighted) directed request graph R with V (R) = T . Our task is to output a subgraph G ⊆ G of the minimum cost such that there is a directed path from s to t in G for all st ∈ A(R). It is known that the problem can be solved in time |V (G)| [Feldman&Ruhl, SIAM J. Comput. 2006]...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 1999